-
1 covering subgraph
Большой англо-русский и русско-английский словарь > covering subgraph
-
2 covering subgraph
Математика: покрывающий подграф -
3 covering subgraph
мат. -
4 subgraph
-
5 subgraph
nounподграф mgreatest common subgraphs наибольшие общие подграфы (р/)Английский-русский словарь по теории вероятностей, статистике и комбинаторике > subgraph
-
6 covering
nounпокрытие nАнглийский-русский словарь по теории вероятностей, статистике и комбинаторике > covering
-
7 покрывающий подграф
Большой англо-русский и русско-английский словарь > покрывающий подграф
-
8 multiplicative
мультипликативный completely multiplicative function ≈ вполне мультипликативная функция countably multiplicative function ≈ счетно мультипликативная функция exponentially multiplicative function ≈ экспоненциально мультипликативная функция multiplicative inverse matrix ≈ мультипликативно обратная матрица multiplicative random variable ≈ мультипликативная случайная величина strongly multiplicative system ≈ сильно мультипликативная система totally multiplicative function ≈ вполне мультипликативная функция unitary multiplicative commutator ≈ унитарный мультипликативный коммутатор - completely multiplicative - multiplicative algorithm - multiplicative arithmetic - multiplicative association - multiplicative axiom - multiplicative base - multiplicative basis - multiplicative calculation - multiplicative category - multiplicative character - multiplicative class - multiplicative closure - multiplicative commutation - multiplicative commutator - multiplicative composition - multiplicative congruence - multiplicative constant - multiplicative control - multiplicative convolution - multiplicative covering - multiplicative decomposition - multiplicative derivative - multiplicative distribution - multiplicative exave - multiplicative filtration - multiplicative form - multiplicative function - multiplicative functional - multiplicative group - multiplicative groupoid - multiplicative homomorphism - multiplicative ideal - multiplicative idempotent - multiplicative identity - multiplicative induction - multiplicative inequality - multiplicative integral - multiplicative interaction - multiplicative inverse - multiplicative inversion - multiplicative lattice - multiplicative model - multiplicative monoid - multiplicative noise - multiplicative nonadditivity - multiplicative norm - multiplicative number - multiplicative object - multiplicative operator - multiplicative order - multiplicative parameter - multiplicative process - multiplicative property - multiplicative representation - multiplicative rule - multiplicative semigroup - multiplicative semilattice - multiplicative set - multiplicative stability - multiplicative structure - multiplicative subgraph - multiplicative subset - multiplicative symmetry - multiplicative system - multiplicative tensor - multiplicative theor - multiplicative transformation - multiplicative utility - multiplicative variety - strongly multiplicative - totally multiplicative мультипликативный, увеличивающий увеличивающийся размножающийся;
относящийся к размножению - * stage стадия размножения (насекомых)Большой англо-русский и русско-английский словарь > multiplicative
См. также в других словарях:
List of NP-complete problems — Here are some of the more commonly known problems that are NP complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP complete problems). Most of the problems in this list are taken… … Wikipedia
Liste De Problèmes NP-Complets — Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problèmes de la décision. Puisqu on connaît plus de 3000 problèmes NP complets, cette liste n est pas exhaustive … Wikipédia en Français
Liste de problemes NP-complets — Liste de problèmes NP complets Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problèmes de la décision. Puisqu on connaît plus de 3000 problèmes NP complets,… … Wikipédia en Français
Liste de problèmes NP-complets — Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problème de décision. Puisqu on connaît plus de 3000 problèmes NP complets, cette liste n est pas exhaustive. La … Wikipédia en Français
Liste de problèmes np-complets — Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problèmes de la décision. Puisqu on connaît plus de 3000 problèmes NP complets, cette liste n est pas exhaustive … Wikipédia en Français
Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and … Wikipedia
Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… … Wikipedia
Pseudoforest — A 1 forest (a maximal pseudoforest), formed by three 1 trees In graph theory, a pseudoforest is an undirected graph[1] in which every connected component has at most one cycle. That is, it is a system of vertices and edges connecting pairs of ve … Wikipedia
combinatorics — /keuhm buy neuh tawr iks, tor , kom beuh /, n. (used with singular v.) See combinatorial analysis. * * * Branch of mathematics concerned with the selection, arrangement, and combination of objects chosen from a finite set. The number of possible… … Universalium
Dominating set — For Dominator in control flow graphs, see Dominator (graph theory). Dominating sets (red vertices). In graph theory, a dominating set for a graph G = (V, E) is a subset D of V such that every vertex not in D is joined to at… … Wikipedia
Median graph — The median of three vertices in a median graph In mathematics, and more specifically graph theory, a median graph is an undirected graph in which any three vertices a, b, and c have a unique median: a vertex m(a,b,c) that belongs to shortest… … Wikipedia